A Non-Deterministic Path Generation Algorithm for Traffic Networks

نویسندگان

  • Bo Zhou
  • Azim Eskandarian
چکیده

In many transportation applications it is useful to find multiple paths for an origin-destination pair. This paper presents a non-deterministic approach to generate alternative paths in traffic networks. The algorithm exhibits desirable features in both computational complexity and path quality. Hypothetic examples are provided to evaluate the generated paths in terms of diversity and efficiency. A microscopic traffic simulation is then used to introduce potential applications in transportation practices. Some future works are also discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traffic Signal Prediction Using Elman Neural Network and Particle Swarm Optimization

Prediction of traffic is very crucial for its management. Because of human involvement in the generation of this phenomenon, traffic signal is normally accompanied by noise and high levels of non-stationarity. Therefore, traffic signal prediction as one of the important subjects of study has attracted researchers’ interests. In this study, a combinatorial approach is proposed for traffic signal...

متن کامل

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Methods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks

Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

متن کامل

A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks

In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...

متن کامل

An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem

The multi-class reliability-based user equilibrium (RUE) problem has been intensively studied in recent years, as it can capture the route choice behaviors of users with heterogeneous risk-aversion under demand and supply uncertainties. Few solution algorithms, however, are available for solving the RUE problems in large-scale road networks. This is mainly due to the non-additive property of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006